Pareto-Based Optimal Sampling Method and Its Applications in Protein Structural Conformation Sampling

نویسندگان

  • Yaohang Li
  • Ashraf Yaseen
چکیده

Efficiently sampling the protein conformation space is a critical step in de novo protein structure modeling. One of the important challenges in sampling is the inaccuracy of available scoring functions, i.e., a scoring function is not always sufficiently accurate to distinguish the correct conformations from the alternatives and thereby exploring the very minimum of a scoring function does not necessary reveal correct conformations. In this paper, we present a Pareto optimal sampling (POS) method to address the inaccuracy problem of scoring functions. The POS method adopts a new computational sampling strategy by exploring diversified conformations on the Pareto optimal front in the function space consisted of multiple scoring functions, representing consensus with different trade-offs among multiple scoring functions. Our computational results in protein loop structure sampling and protein backbone structure sampling have demonstrated the effectiveness of the POS method, where near-natives are found in the ensemble of Pareto-optimal conformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Multiple Scoring Functions Can Improve Protein Loop Structure Prediction Accuracy

Accurately predicting loop structures is important for understanding functions of many proteins. In order to obtain loop models with high accuracy, efficiently sampling the loop conformation space to discover reasonable structures is a critical step. In loop conformation sampling, coarse-grain energy (scoring) functions coupling with reduced protein representations are often used to reduce the ...

متن کامل

MOMCMC: An efficient Monte Carlo method for multi-objective sampling over real parameter space

In this paper,we present a newpopulation-basedMonte Carlomethod, so-calledMOMCMC (Multi-Objective Markov Chain Monte Carlo), for sampling in the presence of multiple objective functions in real parameter space. The MOMCMC method is designed to address the ‘‘multi-objective sampling’’ problem, which is not only of interest in exploring diversified solutions at the Pareto optimal front in the fun...

متن کامل

An energy-based conformer library for side chain optimization: improved prediction and adjustable sampling.

Side chain optimization is a fundamental component of protein modeling applications such as docking, structural prediction, and design. In these applications side chain flexibility is often provided by rotamer or conformer libraries, which are collections of representative side chain conformations. Here we demonstrate that the sampling provided by the library can be substantially improved by ad...

متن کامل

An Evolutionary Search Algorithm to Guide Stochastic Search for Near-Native Protein Conformations with Multiobjective Analysis

Predicting native conformations of a protein sequence is known as de novo structure prediction and is a central challenge in computational biology. Most computational protocols employ Monte Carlo sampling. Evolutionary search algorithms have also been proposed to enhance sampling of near-native conformations. These approaches bias stochastic search by an energy function, even though current ene...

متن کامل

A biobjective method for sample allocation in stratified sampling

The two main and contradicting criteria guiding sampling design are accuracy of estimators and sampling costs. In stratified random sampling, the sample size must be allocated to strata in order to optimize both objectives. In this note we address, following a biobjective methodology, this allocation problem. A two-phase method is proposed to describe the set of Pareto-optimal solutions of this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013